Finite Algebras of Relations Are Representable on Finite Sets
نویسندگان
چکیده
Using a combinatorial theorem of Herwig on extending partial isomorphisms of relational structures, we give a simple proof that certain classes of algebras, including Crs, polyadic Crs, and WA, have thè`nite base property' and have decidable universal theories, and that any nite algebra in each class is representable on a nite set.
منابع مشابه
Weak representations of relation algebras and relational bases
It is known that for all finite n ≥ 5, there are relation algebras with n-dimensional relational bases but no weak representations. We prove that conversely, there are finite weakly representable relation algebras with no n-dimensional relational bases. In symbols: neither of the classesRAn andwRRA contains the other. The main result of this paper concerns the relationship between two classes e...
متن کاملNon-finite axiomatizability of reducts of algebras of relations
In this paper, we prove that any subreduct of the class of representable relation algebras whose similarity type includes intersection, relation composition and converse is a non-finitely axiomatizable quasivariety and that its equational theory is not finitely based. We show the same result for subreducts of the class of representable cylindric algebras of dimension at least three whose simila...
متن کاملOrdered domain algebras
We give a finite axiomatisation to representable ordered domain algebras and show that finite algebras are representable on finite bases.
متن کاملGames in algebraic logic: axiomatisations and beyond
Outline 1. Algebras of relations: a quick introduction to relation algebras, representable relation algebras 2. Case study: atomic and finite relation algebras • atom structures; representations of finite relation algebras • two examples: McKenzie’s algebra; the so-called ‘anti-Monk algebra’ 3. Games to characterise representability: the games, axioms from games, examples 4. Infinite relation a...
متن کاملRepresentations for Small Relation Algebras
There are eighteen isomorphism types of finite relation algebras with eight or fewer elements, and all of them are representable. We determine all the cardinalities of sets on which these algebras have representations.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Symb. Log.
دوره 64 شماره
صفحات -
تاریخ انتشار 1999